A neighbor communication algorithm with making an effective use of NICs on multidimensional-mesh/torus

نویسندگان

  • Yoshiyuki Morie
  • Takeshi Nanri
چکیده

In this paper, a neighbor communication algorithm for large messages in K computer was proposed. The key idea of this algorithm was to devide messages into fragments according to the number of neighboring processes and the number of NICs available on each node, so that the bandwidth of each NIC was fully used. To show the effectiveness of the proposed algorithm, an implementation of the algorithm for six neighbors with four NICs was examined. Experimental results showed that, for large messages, the performance of the proposed algorithm was two times faster than the existing algorithm in mpich-3.0.4.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Executing Algorithms with Hypercube Topology on Torus Multicomputers

Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fa...

متن کامل

CAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip

By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...

متن کامل

Interface assignment and bandwidth allocation for multi-channel wireless mesh networks

With the ability of simultaneous transmissions, multi-channel multi-interface wireless mesh networks (WMNs) have emerged with great potential in the improvement of network throughput and fairness. However, most proposed channel assignment algorithms for WMNs made an assumption that the network interface cards (NICs) are evenly assigned to the mesh routers. In this paper, we investigate the prob...

متن کامل

Row/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips

In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...

متن کامل

Performance Comparison of Mesh and Folded Torus Network under Broadcasting, using Distance Vector Routing Algorithm

In the modern technology of communication architecture, network on chip is widely used as communication architecture. Network on chip topologies are becoming a backbone of communication architectures. Network on chip provides a good integration of huge amount of storage on chip blocks as well as computational also. Network on chip handled the unfavorable conditions and it provides the scalabili...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013